منابع مشابه
An intersection theorem for supermatroids
We generalize the matroid intersection theorem to distributive supermatroids, a structure that extends the matroid to the partially ordered ground set. Distributive supermatroids are special cases of both supermatroids and greedoids, and they generalize polymatroids. This is the first good characterization proved for the intersection problem of an independence system where the ground set is par...
متن کاملExtension of Krull's intersection theorem for fuzzy module
In this article we introduce $mu$-filtered fuzzy module with a family of fuzzy submodules. It shows the relation between $mu$-filtered fuzzy modules and crisp filtered modules by level sets. We investigate fuzzy topology on the $mu$-filtered fuzzy module and apply that to introduce fuzzy completion. Finally we extend Krull's intersection theorem of fuzzy ideals by using concept $mu$-adic comp...
متن کاملAn intersection theorem for systems of sets
Erdos and Rado defined a A-system, as a family in which every two members have the same intersection. Here we obtain a new upper bound on the maximum cardinality q ( n , q ) of an n-uniform family not containing any A-system of cardinality q. Namely, we prove that, for any a > 1 and q , there exists C = C(a, q ) such that, for any n ,
متن کاملAn intersection theorem for weighted sets
A weight function ! : 2 → R¿0 from the set of all subsets of [n]={1; : : : ; n} to the nonnegative real numbers is called shift-monotone in {m+1; : : : ; n} if !({a1; : : : ; aj})¿!({b1; : : : ; bj}) holds for all {a1; : : : ; aj}; {b1; : : : ; bj}⊆ [n] with ai6bi; i = 1; : : : ; j, and if !(A)¿!(B) holds for all A; B⊆ [n] with A⊆B and B\A⊆{m + 1; : : : ; n}. A family F⊆ 2 is called intersectin...
متن کاملAn intersection theorem for four sets
Fix integers n, r ≥ 4 and let F denote a family of r-sets of an n-element set. Suppose that for every four distinct A,B,C,D ∈ F with |A∪B ∪C ∪D| ≤ 2r, we have A∩B ∩C ∩D 6= ∅. We prove that for n sufficiently large, |F| ≤ ( n−1 r−1 ) , with equality only if ⋂ F∈F F 6= ∅. This is closely related to a problem of Katona and a result of Frankl and Füredi [10], who proved a similar statement for thre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1990
ISSN: 0095-8956
DOI: 10.1016/0095-8956(90)90070-g